منابع مشابه
Selective Replicated Declustering for Arbitrary Queries
Data declustering is used to minimize query response times in data intensive applications. In this technique, query retrieval process is parallelized by distributing the data among several disks and it is useful in applications such as geographic information systems that access huge amounts of data. Declustering with replication is an extension of declustering with possible data replicas in the...
متن کاملConflict-Aware Replicated Data Types
Abstract We introduce Conflict-Aware Replicated Data Types (CARDs). CARDs are significantly more expressive than Conflict-free Replicated Data Types (CRDTs) as they support operations that can conflict with each other. Introducing conflicting operations typically brings the need to block an operation in at least some executions, leading to potential inefficiencies, and difficulties in reasoning...
متن کاملMaintaining Replicated Recovery Log for RESTful Services
Along with development of information systems, their requirements in terms of fault-tolerance increase and become more stringent. A possible approach to deal with this issue is rollback-recovery that consists in loading by the recovering node its most recent checkpoint, or retransmitting requests saved in its message log, to reach a consistent pre-failure state. Both checkpoint and message log ...
متن کاملQuery log analysis with LangLog
This article describes GALATEAS LangLog, a system performing Search Log Analysis. LangLog illustrates how NLP technologies can be a powerful support tool for market research even when the source of information is a collection of queries each one consisting of few words. We push the standard Search Log Analysis forward taking into account the semantics of the queries. The main innovation of Lang...
متن کاملWorkload Aware Replicated Datapartitioning for Twitter
Most of the queries in twitter include multiuser operations. When a user login to twitter it requests the most recent tweets of whom he follows. These data may be present in different servers. The expense of these queries depends on how the data is partitioned. Existing solution for data partitioning involve hash or graph based partition. In this paper a new method for reducing the interaction ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2013
ISSN: 1045-9219
DOI: 10.1109/tpds.2012.113